Two forbidden subgraphs and the existence of a 2-factor in graphs
نویسندگان
چکیده
In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be significantly reduced if one also requires that the graph is not only star-free but also of sufficiently high edge-connectivity. In this paper we reduce the minimum degree condition further for star-free graphs that also avoid WMr, where WMr is the graph K1 + rK2.
منابع مشابه
Forbidden subgraphs and the existence of a 2-factor
For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...
متن کاملA Pair of Forbidden Subgraphs and 2-Factors
In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. For d ≥ 2, let Gd be the set of connected graphs of minimum degree at least d. Let F1 and F2 be connected graphs and let H be a set of connected graphs. Then {F1, F2} is said to be a forbidden pair for H if every {F1, F2}-free graph in H of sufficiently large order has a 2-factor. Faudree,...
متن کاملForbidden Subgraphs for Planar Blict and Blitact Graphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraphs they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. Such subgraphs are called forbidden subgraphs. In this paper, we present characterizations of graphs whose blict and bl...
متن کاملForbidden subgraphs generating a finite set
For a set F of connected graphs, a graph G is said to be F-free if G does not contain any member of F as an induced subgraph. The members of F are referred to as forbidden subgraphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow the existence of exceptional graphs as long as their number is finite. However, in this type of research, if t...
متن کاملBlack-and-White Threshold Graphs
Let k be a natural number. We introduce k-threshold graphs. We show that there exists anO(n) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of forbidden induced subgraphs. For the case k = 2 we characterize the partitioned 2threshold graphs by forbidden induced subgraphs. We introduce restricted, and spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 44 شماره
صفحات -
تاریخ انتشار 2009